Proper Forcing Remastered
نویسندگان
چکیده
We present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: a variation of the Friedman-Mitchell poset for adding a club with finite conditions, the consistency of the existence of an ω2 increasing chain in (ω1 1 , <fin), originally proved by Koszmider, and the existence of a thin very tall superatomic Boolean algebra, originally proved by Baumgartner-Shelah. We expect that the present method will have many more applications.
منابع مشابه
Proper forcing extensions and Solovay models
We study the preservation of the property of L(R) being a Solovay model under proper projective forcing extensions. We show that every ∼ 1 3 strongly-proper forcing notion preserves this property. This yields that the consistency strength of the absoluteness of L(R) under ∼ 1 3 strongly-proper forcing notions is that of the existence of an inaccessible cardinal. Further, the absoluteness of L(R...
متن کاملProper forcing, cardinal arithmetic, and uncountable linear orders
In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ1-definable in (H(ω2),∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω1, ω∗ 1 , C, C ∗ where X is any suborder of the reals of size ...
متن کاملGeneric Vopěnka's Principle, remarkable cardinals, and the weak Proper Forcing Axiom
We introduce and study the first-order Generic Vopěnka’s Principle, which states that for every definable proper class of structures C of the same type, there exist B 6= A in C such that B elementarily embeds into A in some set-forcing extension. We show that, for n ≥ 1, the Generic Vopěnka’s Principle fragment for Πn-definable classes is equiconsistent with a proper class of n-remarkable cardi...
متن کاملThe Bounded Proper Forcing Axiom
The bounded proper forcing axiom BPFA is the statement that for any family of א1 many maximal antichains of a proper forcing notion, each of size א1, there is a directed set meeting all these antichains. A regular cardinal κ is called Σ1-reflecting, if for any regular cardinal χ, for all formulas φ, “H(χ) |= ‘φ’ ” implies “∃δ<κ, H(δ) |= ‘φ’ ” We show that BPFA is equivalent to the statement tha...
متن کاملSubcomplete Forcing and L-Forcing
ABSRACT In his book Proper Forcing (1982) Shelah introduced three classes of forcings (complete, proper, and semi-proper) and proved a strong iteration theorem for each of them: The first two are closed under countable support iterations. The latter is closed under revised countable support iterations subject to certain standard restraints. These theorems have been heavily used in modern set th...
متن کامل